#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
struct P{
    LL op,id1,id2;
};
vector<P>ans;
LL a[maxn];
void op1(LL idx1,LL idx2){
   ans.push_back({1,idx1,idx2});
}
void op2(LL idx1,LL idx2){
   ans.push_back({2,idx1,idx2});
}
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        ans.clear();
        LL n;cin>>n;
        for(LL i=1;i<=n;i++) cin>>a[i];
        for(LL i=1;i<=n;i+=2){
            op1(i,i+1);
            op1(i,i+1);
            op2(i,i+1);
            op1(i,i+1);
            op1(i,i+1);
            op2(i,i+1);
        }
        cout<<ans.size()<<"\n";
        for(auto i:ans){
            cout<<i.op<<" "<<i.id1<<" "<<i.id2<<"\n";
        }
    }
   	return 0;
}
